Proving Existential Theorems when Importing Results from MDG to HOL
نویسندگان
چکیده
An existential theorem, for the specification or implementation of hardware, states that for any inputs there must exist at least one output which is consistent with it. It is proved to prevent an inconsistent model being produced and it is required to formally import the verification result from one verification system to another system. In this paper, we investigate the verification of the existential theorems of hardware specifications and implementations. Whilst much of the approach is generally applicable, we specifically consider a hybrid system linking the MDG hardware verification system with the HOL interactive proof system. We investigate existential theorems based on the syntax and semantics of the MDG input language (MDG-HDL) in HOL. We define an output representation for each component in the MDG-HDL component library. We summarize a general method which is used to prove the existential theorem for any MDG-HDL program. The method can also be used to solve other existentially quantified goals.
منابع مشابه
Providing a formal linkage between MDG and HOL based on a verified MDG system
We describe a methodology which can provide a formal linkage between a symbolic state enumeration system and a theorem proving system based on a veri ed symbolic state enumeration system. The methodology has been partly realized in a simpli ed version of the MDG system (a symbolic state enumeration system) and the HOL system (a theorem proving system) which involves the following three steps. F...
متن کاملImporting MDG Verification Results into HOL
Formal hardware veriication systems can be split into two categories: theorem proving systems and automatic nite state machine based systems. Each approach has its own complementary advantages and disadvantages. In this paper, we consider the combination of two such systems: HOL (a theorem proving system) and MDG (an automatic system). As HOL hardware veriication proofs are based on the hierarc...
متن کاملImporting the Results of Automatic Hardware Veri cation into HOL
Formal hardware veri cation systems can be split into two categories: theorem proving systems and automatic nite state machine based systems. Each approach has its own complementary advantages and disadvantages. In this paper, we consider the combination of two such systems: HOL (a theorem proving system) and MDG (an automatic system). As HOL hardware veri cation proofs are based on the hierarc...
متن کاملProviding a formal linkage between MDG and HOL
We describe an approach for formally verifying the linkage between a symbolic state enumeration system and a theorem proving system. This involves the following three stages of proof. Firstly we prove theorems about the correctness of the translation part of the symbolic state system. It interfaces between low level decision diagrams and high level description languages. We ensure that the sema...
متن کاملProviding a Formal Linkage between the MDG Veri cation System and HOL Proof System
We describe an approach for formally linking a symbolic state enumeration system and a theorem proving system based on a veri ed version of the former. It has been realized using the HOL system and a simpli ed version of the MDG system. It involves the following three steps. Firstly, we have veri ed aspects of correctness of a simpli ed version of the MDG system. We have made certain that the s...
متن کامل